A Decision Method for Duration Calculus

The Duration Calculus is an interval logic introduced for designing realtime systems. This calculus is able to capture important real-time problems like the speci cation of the behaviours of schedulers and classical examples like a gas burner. From a practical point of view an important challenge becomes to de ne automated proof procedures for this calculus. Since the propositional calculus is undecidable, we are interested then into isolating decidable fragments of this calculus. A rst fragment was given and its decidability proved via regular languages. In this paper we isolate another fragment and we de ne a tableau method which gives a natural procedure to decide whether a given formula is satis able.